A Linear-Time Approximation Algorithm for Rotation Distance
نویسندگان
چکیده
منابع مشابه
A Linear-Time Approximation Algorithm for Rotation Distance
Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In this short note, we give an efficient, linear-time approximation algorithm, which estimates the rotation distance, within a provable factor of 2, between ordered rooted binary trees. ...
متن کاملA Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the double cut and join (DCJ) operation. Given two genomes with the same content, so that we have exactly the same number of copies of each gene in each genome, we are interested in the problem of compu...
متن کاملSimple linear time approximation algorithm for betweenness
We present a simple linear time combinatorial algorithm for the Betweenness problem. In the Betweenness problem, we are given a set of vertices and betweenness constraints. Each betweenness constraint of the form x {y, z} requires that vertex x lies between vertices y and z. Our goal is to find a linear ordering of vertices that maximizes the number of satisfied constraints. In 1995, Chor and S...
متن کاملA Cubic-Time 2-Approximation Algorithm for rSPR Distance
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted subtree prune and regraft (rSPR) distance of the two trees has been used for this purpose. The problem of computing the rSPR distance of two given ...
متن کاملA General Algorithm for Computing Distance Transforms in Linear Time
A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2010
ISSN: 1526-1719
DOI: 10.7155/jgaa.00212